Typed query languages for databases containing queries

Universal Queries for Relational Query Languages

Finite Query Languages for Sequence Databases

This paper develops a query language for sequence databases, such as genome databases and text databases. Unlike relational data, queries over sequential data can easily produce infinite answer sets, since the universe of sequences is infinite, even for a finite alphabet. The challenge is to develop query languages that are both highly expressive and finite. This paper develops such a language....

On Query Languages for Linear Queries Definable with Polynomial Constraints

It has been argued that the linear database model in which semi linear sets are the only geometric objects is very suitable for most spatial database applications For querying linear databases the lan guage FO linear has been proposed We present both negative and positive results regarding the expressiveness of FO linear First we show that the dimension query is de nable in FO linear which allo...

Database Query Languages Embedded in the Typed Lambda Calculus

We investigate the expressive power of the typed-calculus when expressing computations over nite structures, i.e., databases. We show that the simply typed-calculus can express various database query languages such as the relational algebra, xpoint logic, and the complex object algebra. In our embeddings, inputs and outputs are-terms encoding databases, and a program expressing a query is a-ter...

Query processing in spatial databases containing obstacles

Despite the existence of obstacles in many database applications, traditional spatial query processing assumes that points in space are directly reachable and utilizes the Euclidean distance metric. In this paper, we study spatial queries in the presence of obstacles, where the obstructed distance between two points is defined as the length of the shortest path that connects them without crossi...